ERASE: Energy Efficient Task Mapping and Resource Management for Work Stealing Runtimes

نویسندگان

چکیده

Parallel applications often rely on work stealing schedulers in combination with fine-grained tasking to achieve high performance and scalability. However, reducing the total energy consumption context of runtimes is still challenging, particularly when using asymmetric architectures different types CPU cores. A common approach for savings involves dynamic voltage frequency scaling (DVFS) wherein throttling carried out based factors like task parallelism, relations, criticality. This article makes following observations: (i) leveraging DVFS a per-task basis impractical environments cluster/chip-level DVFS; (ii) moldability, single can execute multiple threads/cores via work-sharing, help reduce consumption; (iii) mismatch between tasks assigned resources (i.e., core type number cores) detrimentally impact consumption. In this article, we propose EneRgy Aware SchedulEr (ERASE), an intra-application scheduler top that aims parallel applications. It achieves by guiding scheduling decisions predictions resource configurations. addition, ERASE capable adapting both given static settings externally controlled DVFS. Overall, up 31% improves 44% average, compared state-of-the-art DVFS-based schedulers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Task Binding in Work Stealing Runtimes for Numa Multi-core Processors

Modern server processors in high performance computing consist of multiple integrated memory controllers on-chip and behave as NUMA in nature. Many user level runtime systems like Open MP, Cilk and TBB provide task construct for programming multi core processors. Task body may define the code that can access task local data and also shared data. Most of the shared data is scattered across virtu...

متن کامل

Executing Dynamic Task Graphs Using Work-Stealing

Nabbit is a work-stealing library for executing dynamic task graphs with arbitrary dependencies. We prove that Nabbit achieves asymptotically optimal performance for task graphs whose nodes have constant in-degree and out-degree. We have implemented Nabbit in the multithreaded programming language Cilk++. Since the implementation of Nabbit required no modification to the Cilk++ runtime system, ...

متن کامل

Achieving Efficient Work-Stealing for Data-Parallel Collections

In modern programming high-level data-structures are an important foundation for most applications. With the rise of the multicore era, there is a growing trend of supporting data-parallel collection operations in general purpose programming languages and platforms. To facilitate object-oriented reuse these operations are highly parametric, incurring abstraction performance penalties. Furthermo...

متن کامل

Energy-Efficient and Thermal-Aware Resource Management for Heterogeneous Datacenters

We propose in this paper to study the energy-, thermaland performance-aware resource management in heterogeneous datacenters. Witnessing the continuous development of heterogeneity in datacenters, we are confronted with their different behaviors in terms of performance, power consumption and thermal dissipation: Indeed, heterogeneity at server level lies both in the computing infrastructure (co...

متن کامل

Dynamic Task Parallelism with a GPU Work-Stealing Runtime System

NVIDIA’s Compute Unified Device Architecture (CUDA) and its attached C/C++ based API went a long way towards making GPUs more accessible to mainstream programming. So far, the use of GPUs for high performance computing has been primarily restricted to data parallel applications, and with good reason. The high number of computational cores and high memory bandwidth supported by the device makes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2022

ISSN: ['1544-3973', '1544-3566']

DOI: https://doi.org/10.1145/3510422